A Self-Adaptive Approach to Representation Shifts in Cultural Algorithms
نویسندگان
چکیده
The paper describes how a formal model of selfadaptation [Angeline, 1995] can be expressed in terms of Cultural Algorithms. A particular form of self-adaptation concerns the shifting of the representational bias used to described the set of learned beliefs within the Cultural Algorthms. A version of Cultural Algorithms with the ability to shift its representational bias was used to solve the Royal Road problem suggested by Holland. The results of the experiments indicate that representational self-adaptations such as this can produce significant performance improvements over systems without such capabilities for problems whose performance function is inherently hierarchical, as is the case in the Royal Road function.
منابع مشابه
A new adaptive exponential smoothing method for non-stationary time series with level shifts
Simple exponential smoothing (SES) methods are the most commonly used methods in forecasting and time series analysis. However, they are generally insensitive to non-stationary structural events such as level shifts, ramp shifts, and spikes or impulses. Similar to that of outliers in stationary time series, these non-stationary events will lead to increased level of errors in the forecasting pr...
متن کاملAdaptive Rule-Base Influence Function Mechanism for Cultural Algorithm
This study proposes a modified version of cultural algorithms (CAs) which benefits from rule-based system for influence function. This rule-based system selects and applies the suitable knowledge source according to the distribution of the solutions. This is important to use appropriate influence function to apply to a specific individual, regarding to its role in the search process. This rule ...
متن کاملSolving Graph Coloring Problems Using Cultural Algorithm
This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner...
متن کاملOn Feasibility of Adaptive Level Hardware Evolution for Emergent Fault Tolerant Communication
A permanent physical fault in communication lines usually leads to a failure. The feasibility of evolution of a self organized communication is studied in this paper to defeat this problem. In this case a communication protocol may emerge between blocks and also can adapt itself to environmental changes like physical faults and defects. In spite of faults, blocks may continue to function since ...
متن کاملApplication to Adaptive Control to Synchronous Machine Excitation
Self-tuning adaptive control technique has the advantage of being able to track the system operating conditions so that satisfactory control action can always be produced. Self-tuning algorithms can be implemented easily. Because the power systems are usually time varying non-linear systems and their parameters vary, adaptive controllers are very suitable for power systems. Characteristics of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996